A BIBLIOGRAPHIC CATCH TITLE FOR EVER AND EVER

Programs for Ever Programs for Ever

This article reflects our experience with the preservation of computer programs that once served a scientific purpose, but were not maintained since then. After producing results, published in scientific journals in the 70’s, 80’s and begin 90’s, they were stored provisionally on some kind of persistent medium and are at present restored to current state of the art hardware. We constructed an a...

Can we ever catch up with the Web?

The Semantic Web is about to grow up. By efforts such as the Linking Open Data initiative, we finally find ourselves at the edge of a Web of Data becoming reality. Standards such as OWL 2, RIF and SPARQL 1.1 shall allow us to reason with and ask complex structured queries on this data, but still they do not play together smoothly and robustly enough to cope with huge amounts of noisy Web data. ...

Language is never , ever , ever , random

Language users never choose words randomly, and language is essentially non-random. Statistical hypothesis testing uses a null hypothesis, which posits randomness. Hence, when we look at linguistic phenomena in corpora, the null hypothesis will never be true. Moreover, where there is enough data, we shall (almost) always be able to establish that it is not true. In corpus studies, we frequently...

Stars and stripes--for ever?

Evolution of Information and Complexity in an Ever-Expanding Universe

Using the usual definitions of information and entropy in quantum gravity and statistical mechanics and the existing views about the relation between information and complexity, we examine the evolution of complexity in an ever expanding universe.